Computing outer inverses by scaled matrix iterations
نویسندگان
چکیده
منابع مشابه
Successive matrix squaring algorithm for computing outer inverses
In this paper we derive a successive matrix squaring (SMS) algorithm to approximate an outer generalized inverse with prescribed range and null space of a given matrix A ∈ Cm×n r . We generalize the results from the papers [3], [16], [18], and obtain an algorithm for computing various classes of outer generalized inverses of A. Instead of particular matrices used in these articles, we use an ap...
متن کاملSome Matrix Iterations for Computing Generalized Inverses and Balancing Chemical Equations
An application of iterative methods for computing the Moore–Penrose inverse in balancing chemical equations is considered. With the aim to illustrate proposed algorithms, an improved high order hyper-power matrix iterative method for computing generalized inverses is introduced and applied. The improvements of the hyper-power iterative scheme are based on its proper factorization, as well as on...
متن کاملGauss-Jordan elimination method for computing outer inverses
This paper deals with the algorithm for computing outer inverse with prescribed range and null space, based on the choice of an appropriate matrix G and Gauss–Jordan elimination of the augmented matrix [G | I]. The advantage of such algorithms is the fact that one can compute various generalized inverses using the same procedure, for different input matrices. In particular, we derive representa...
متن کاملComputing generalized inverses using LU factorization of matrix product
An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4}-inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A{2, 3}s and A{2, 4}s are characterized in terms of matrix products (R∗A)†R∗ and T ∗(AT ∗)†, where R and T are rational matrices with appropriate dimensions and corresponding rank. The proposed algorithm is based on these general representat...
متن کاملComputing the lowest eigenvalues of the Fermion matrix by subspace iterations
provides the smallest eigenvalue, together with the corresponding eigenvector. The minimum of a functional can be found iteratively by the method of conjugate gradients (CG)[1], its application to the special case of the Ritz functional has been worked out by Geradin[2] and Fried[3]. If a small number of lowest eigenvalues is required instead, q(x) may be minimised repeatedly, restricting x to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.09.013